a=[i for i in input()]
res=list()
for c in a:
if res:
if c==res[-1]:
res.pop()
else:
res.append(c)
else:
res.append(c)
print("".join(res))
/******************************************************************************
Online C++ Compiler.
Code, Compile, Run and Debug C++ program online.
Write your code in this editor and press "Run" button to compile and execute it.
*******************************************************************************/
#include <bits/stdc++.h>
using namespace std;
int main()
{
string s ;
cin >> s ;
stack <char> stack ;
stack.push(s[0]) ;
for( int i = 1 ; i < s.size() ; i++ )
{
while( !stack.empty() && s[i] == stack.top() )
{
stack.pop() ;
i++ ;
}
if( i < s.size())
{
stack.push(s[i]) ;
}
}
int t ;
t = stack.size() ;
char arr[t] ;
for( int i = 0 ; i < t ; i++ )
{
arr[i] = stack.top() ;
stack.pop() ;
}
for( int i = (t - 1) ; i >= 0 ; i-- )
{
cout << arr[i] ;
}
return 0;
}1588. Sum of All Odd Length Subarrays | 1662. Check If Two String Arrays are Equivalent |
1832. Check if the Sentence Is Pangram | 1678. Goal Parser Interpretation |
1389. Create Target Array in the Given Order | 1313. Decompress Run-Length Encoded List |
1281. Subtract the Product and Sum of Digits of an Integer | 1342. Number of Steps to Reduce a Number to Zero |
1528. Shuffle String | 1365. How Many Numbers Are Smaller Than the Current Number |
771. Jewels and Stones | 1512. Number of Good Pairs |
672. Richest Customer Wealth | 1470. Shuffle the Array |
1431. Kids With the Greatest Number of Candies | 1480. Running Sum of 1d Array |
682. Baseball Game | 496. Next Greater Element I |
232. Implement Queue using Stacks | 844. Backspace String Compare |
20. Valid Parentheses | 746. Min Cost Climbing Stairs |
392. Is Subsequence | 70. Climbing Stairs |
53. Maximum Subarray | 1527A. And Then There Were K |
1689. Partitioning Into Minimum Number Of Deci-Binary Numbers | 318. Maximum Product of Word Lengths |
448. Find All Numbers Disappeared in an Array | 1155. Number of Dice Rolls With Target Sum |